Preemptive Scheduling on Selfish Machines
نویسندگان
چکیده
We consider the problem of scheduling on parallel uniformly related machines, where preemptions are allowed and the machines are controlled by selfish agents. Our goal is to minimize the makespan, whereas the goal of the agents is to maximize their profit. We show that a known algorithm is monotone and can therefore be used to create a truthful mechanism for this problem which achieves the optimal makespan. We extend this result for additional common goal functions.
منابع مشابه
Literature Review of Single Machine Scheduling Problem with Uniform Parallel Machines
This paper presents a survey of single machine scheduling problem with uniform parallel machines. The single machine scheduling problem with uniform parallel machines consists of n jobs, each with single operation, which are to be scheduled on m parallel machines with different speeds. These parallel machines are also called proportional machines or related machines. There are several measures ...
متن کاملLECTURE #1 Roles of LPT List Scheduling on Parallel Machines
List Scheduling is an approach to finding an approximate non-preemptive schedule on parallel machines, initially due to Graham [4]. We present and analyze the approach for identical machines and an arbitrary jobs list. Then an algorithm based on the LPT (Longest Processing Time) list with an improved performance is discussed, based on [2, 5]. We stress the role of LPT schedules for determining ...
متن کاملSelfish Scheduling with Setup Times
We study multiprocessor scheduling games with setup times on identical machines. Given a set of scheduling policies (coordination mechanism) on the machines, each out of n players chooses a machine to assign his owned job to, so as to minimize his individual completion time. Each job has a processing length and is of a certain type. Same-type jobs incur a setup overhead to the machine they are ...
متن کاملPower of Preemption on Uniform Parallel Machines
For a scheduling problem on parallel machines, the power of preemption is defined as the ratio of the makespan of an optimal non-preemptive schedule over the makespan of an optimal preemptive schedule. For m uniform parallel machines, we give the necessary and sufficient conditions under which the global bound of 2 − 1/m is tight. If the makespan of the optimal preemptive schedule is defined by...
متن کاملSemi-online scheduling with decreasing job sizes
We investigate the problem of semi-online scheduling jobs on m identical parallel machines where the jobs arrive in order of decreasing sizes. We present a complete solution for the preemptive variant of semi-online scheduling with decreasing job sizes. We give matching lower and upper bounds on the competitive ratio for any xed number m of machines; these bounds tend to 1 2 (1+ p 3) 1:36603, a...
متن کامل